Constraint qualifications in linear vector semi-infinite optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs

The paper concerns the study of new classes of nonlinear and nonconvex optimization problems of the so-called infinite programming that are generally defined on infinite-dimensional spaces of decision variables and contain infinitely many of equality and inequality constraints with arbitrary (may not be compact) index sets. These problems reduce to semi-infinite programs in the case of finite-d...

متن کامل

New Farkas-type Constraint Qualifications in Convex Infinite Programming

This paper provides KKT and saddle point optimality conditions, duality theorems and stability theorems for consistent convex optimization problems posed in locally convex topological vector spaces. The feasible sets of these optimization problems are formed by those elements of a given closed convex set which satisfy a (possibly in…nite) convex system. Moreover, all the involved functions are ...

متن کامل

On stable uniqueness in linear semi-infinite optimization

This paper is intended to provide conditions for the stability of the strong uniqueness of the optimal solution of a given linear semi-in…nite optimization (LSIO) problem, in the sense of the maintaining of the strong uniqueness property under su¢ ciently small perturbations of all the data. We consider LSIO problems such that the family of gradients of all the constraints is unbounded, extendi...

متن کامل

On linear vector optimization duality in infinite-dimensional spaces∗

In this paper we extend to infinite-dimensional spaces a vector duality concept recently considered in the literature in connection to the classical vector minimization linear optimization problem in a finite-dimensional framework. Weak, strong and converse duality for the vector dual problem introduced with this respect are proven and we also investigate its connections to some classical vecto...

متن کامل

Composite semi - infinite optimization

Abstract: We consider a semi-infinite optimization problem in Banach spaces, where both the objective functional and the constraint operator are compositions of convex nonsmooth mappings and differentiable mappings. We derive necessary optimality conditions for these problems. Finally, we apply these results to nonconvex stochastic optimization problems with stochastic dominance constraints, ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2013

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2012.09.006